Minimum Convex Partition of Polygonal Domains by Guillotine Cuts
نویسندگان
چکیده
منابع مشابه
Continued fraction absorbing boundary conditions for convex polygonal domains
Continued fraction absorbing boundary conditions (CFABCs) are highly effective boundary conditions for modelling wave absorption into unbounded domains. They are based on rational approximation of the exact dispersion relationship and were originally developed for straight computational boundaries. In this paper, CFABCs are extended to the more general case of polygonal computational domains. T...
متن کاملMinimum convex partition of a constrained point set
A convex partition with respect to a point set S is a planar subdivision whose vertices are the points of S, where the boundary of the unbounded outer face is the boundary of the convex hull of S, and every bounded interior face is a convex polygon. A minimum convex partition with respect to S is a convex partition of S such that the number of convex polygons is minimised. In this paper, we wil...
متن کاملGraph Partition by Swendsen-Wang Cuts
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncut using spectral graph analysis and the minimum-cut using the maximum flow algorithm. This paper presents a third major approach by generalizing the Swendsen-Wang method– a well celebrated algorithm in statistical mech...
متن کاملTight Time Bounds for the Minimum Local Convex Partition Problem
Let v be a vertex with n edges incident to it, such that the n edges partition an infinitesimally small circle C around v into convex pieces. The minimum local convex partition (MLCP) problem asks for two or three out of the n edges that still partition C into convex pieces and that are of minimum total length. We present an optimal algorithm solving the problem in linear time if the edges inci...
متن کاملMinimum Cuts
1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1998
ISSN: 0179-5376
DOI: 10.1007/pl00009346